A free-algebraic solution for the planar approximation
نویسندگان
چکیده
منابع مشابه
A Free-Algebraic Solution for the Planar Approximation
An explicit solution for the generating functional of n-point functions in the planar approximation is given in terms of two sets of free-algebraic annihilation and creation operators.
متن کاملPrimitive Geometric Operations on Planar Algebraic Curves with Gaussian Approximation
We present a curve approximation method which approximates each planar algebraic curve segment by discrete curve points at each of which the curve has its gradient from a set of uniformly distributed normals. This method, called Gaussian Approximation (GAP), provides efficient algorithms for various primitive geometric operations, especially for those related with gradients such as common tange...
متن کاملA fractional type of the Chebyshev polynomials for approximation of solution of linear fractional differential equations
In this paper we introduce a type of fractional-order polynomials based on the classical Chebyshev polynomials of the second kind (FCSs). Also we construct the operational matrix of fractional derivative of order $ gamma $ in the Caputo for FCSs and show that this matrix with the Tau method are utilized to reduce the solution of some fractional-order differential equations.
متن کاملA Numerical and Analytical Solution for the Free Vibration of Laminated Composites Using Different Plate Theories
An analytical and numerical solution for the free vibration of laminated polymeric composite plates with different layups is studied in this paper. The governing equations of the laminated composite plates are derived from the classical laminated plate theory (CLPT) and the first-order shear deformation plate theory (FSDT). General layups are evaluated by the assumption of cross-ply and angle-p...
متن کاملA Boundary Approximation Algorithm for Planar Domains
Suppose T is a triangulation T of R with edges E and vertices V, and suppose Ω is a bounded open subset of R. Let Vin = {v ∈ V : v ∈ Ω}. In this paper we will give an algorithm which uses Vin and nothing else to construct a finite disjointed family P of simple closed polygons whose union approximates, in a sense we shall make precise, the boundary ∂Ω of Ω. Of course we will need to assume somet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nuclear Physics B
سال: 2005
ISSN: 0550-3213
DOI: 10.1016/j.nuclphysb.2004.10.040